Neural Networks Regularization with Graph-based Local Resampling
نویسندگان
چکیده
منابع مشابه
Weight Averaging for Neural Networks and Local Resampling Schemes
Recently methods for combining estimators have been popular and enjoyed considerable success. Typically, one obtains several models by considering diierent model architectures (e.g. linear or nonlinear) or uses diierent partitions of the data (overlapping or non-overlapping) for estimating the model. In a nal step the outputs of each model are combined, either by assigning xed weights a priori ...
متن کاملConstructive Neural Networks with Regularization
In this paper we present a regularization approach to the training of all the network weights in cascadecorrelation type constructive neural networks. Especially, the case of regularizing the output neuron of the network is presented. In this case, the output weights are trained by employing a regularized objective function containing a penalty term which is proportional to the weight values of...
متن کاملRegularization for Neural Networks
Research into regularization techniques is motivated by the tendency of neural networks to to learn the specifics of the dataset it was trained on rather than learning general features that are applicable to unseen data. This is known as overfitting. The goal of any supervised machine learning task is to approximate a function that maps inputs to outputs, given a dataset of examples and labels....
متن کاملSemi-Supervised Phone Classification using Deep Neural Networks and Stochastic Graph-Based Entropic Regularization
We describe a graph-based semi-supervised learning framework in the context of deep neural networks that uses a graph-based entropic regularizer to favor smooth solutions over a graph induced by the data. The main contribution of this work is a computationally efficient, stochastic graph-regularization technique that uses mini-batches that are consistent with the graph structure, but also provi...
متن کاملLearning Latent Representations in Neural Networks for Clustering through Pseudo Supervision and Graph-based Activity Regularization
In this paper, we propose a novel unsupervised clustering approach exploiting the hidden information that is indirectly introduced through a pseudo classification objective. Specifically, we randomly assign a pseudo parent-class label to each observation which is then modified by applying the domain specific transformation associated with the assigned label. Generated pseudo observation-label p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3068127